Maximal Clones on Uncountable Sets That Include All Permutations

نویسنده

  • MICHAEL PINSKER
چکیده

We first determine the maximal clones on a set X of infinite regular cardinality κ which contain all permutations but not all unary functions, extending a result of Heindorf’s for countably infinite X. If κ is countably infinite or weakly compact, this yields a list of all maximal clones containing the permutations since in that case the maximal clones above the unary functions are known. We then generalize a result of Gavrilov’s to obtain on all infinite X a list of all maximal submonoids of the monoid of unary functions which contain the permutations. 1. Clones and the Results 1.1. The clone lattice. Let X be a set of size |X| = κ. For each natural number n ≥ 1 we denote the set of functions on X of arity n by O(n). We set O = ⋃∞ n=1 O (n) to be the set of all finitary operations on X. A clone is a subset of O which contains the projection maps and which is closed under composition. Since arbitrary intersections of clones are obviously again clones, the set of clones on X forms a complete algebraic lattice Cl(X) which is a subset of the power set of O. The clone lattice is countably infinite if X has exactly two elements, and of size continuum if X is finite and has at least three elements. On infinite X we have |Cl(X)| = 22 κ . The dual atoms of the clone lattice are called maximal clones. On finiteX there exist finitely many maximal clones and an explicit list of those clones has been provided by Rosenberg [6]. Moreover, the clone lattice is dually atomic in that case, that is, every clone is contained in a maximal one. For X infinite the number of maximal clones equals the size of the whole clone lattice ([8], see also [2]), so that it seems impossible to know all of them. It has also been shown [3] that if the continuum hypothesis holds, then not every clone on a countably infinite set is contained in a maximal one. 1.2. Clones containing the bijections. However, even on infinite X the sublattice of Cl(X) of clones containing the set S of all permutations of X 1991 Mathematics Subject Classification. Primary 08A40; secondary 08A05.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Precomplete Clones on Infinite Sets Which Are Closed under Conjugation

We show that on an infinite set, there exist no other precomplete clones closed under conjugation except those which contain all permutations. Since on base sets of some infinite cardinalities, in particular on countably infinite ones, the precomplete clones containing the permutations have been determined, this yields a complete list of the precomplete conjugation-closed clones in those cases....

متن کامل

Uncountable Families of Partial Clones Containing Maximal Clones

Let A be a non singleton finite set. We show that every maximal clone determined by a prime affine or h-universal relation on A is contained in a family of partial clones on A of continuum cardinality. MSC 2000: 03B50, 08A40, 08A55

متن کامل

The Minimal Clones above the Permutations

We determine the atoms of the interval of the clone lattice consisting of those clones which contain all permutations, on an infinite base set. This is equivalent to the description of the atoms of the lattice of transformation monoids above the permutations. 1. The problem and the result Let X be an infinite set of cardinality κ = אα, let O be the set of all finitary operations on X, and for a...

متن کامل

Cubes of Conjugacy Classes Covering the Infinite Symmetric Group

Using combinatorial methods, we prove the following theorem on the group S of all permutations of a countably-infmite set: Whenever p 6 S has infinite support without being a fixed-point-free involution, then any s G S is a product of three conjugates of p. Furthermore, we present uncountably many new conjugacy classes C of S satisfying that any s G S is a product of two elements of C. Similar ...

متن کامل

The Number of Unary Clones Containing the Permutations on an Infinite Set

We calculate the number of unary clones (submonoids of the full transformation monoid) containing the permutations, on an infinite base set. It turns out that this number is quite large, sometimes as large as the whole clone lattice. 1. Background and the result Fix a set X and consider for all n ≥ 1 the set O(n) of n-ary operations on X. If we take the union O = ⋃ n≥1 O (n) over these sets, we...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005